Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal
نویسنده
چکیده
منابع مشابه
Reversible conservative rational abstract geometrical computation is Turing - universal ( extended abstract ) Jérôme Durand - Lose
In Abstract geometrical computation for black hole computation (MCU ’04, LNCS 3354), the author provides a setting based on rational numbers, abstract geometrical computation, with super-Turing capability. In the present paper, we prove the Turing computing capability of reversible conservative abstract geometrical computation. Reversibility allows backtracking as well as saving energy; it corr...
متن کاملAbstract Geometrical Computation 6: A Reversible, Conservative and Rational Based Model for Black Hole Computation
geometrical computation 6: a reversible, conservative and rational-based model for Black hole computation JÉRÔME DURAND-LOSE?† LIFO, Université d’Orléans, B.P. 6759, F-45067 ORLÉANS Cedex 2. In the context of Abstract geometrical computation, the Black hole model of computation (and SAD computers) have been implemented. In the present paper, based on reversible and (energy) conservative stacks,...
متن کاملAbstract geometrical computation 4: Small Turing universal signal machines
geometrical computation 4: small Turing universal signal machines
متن کاملForecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable
In Abstract geometrical computation for black hole computation (MCU ’04, LNCS 3354), the author provides a setting based on rational numbers, abstract geometrical computation, with super-Turing capability: any recursively enumerable set can be decided in finite time. To achieve this, a Zeno-like construction is used to provide an accumulation similar in effect to the black holes of the black ho...
متن کاملSimulating the Fredkin Gate with Energy-Based P Systems
Reversibility plays a fundamental role when the possibility to perform computations with minimal energy dissipation is considered. Many papers on reversible computation have appeared in literature: the most famous are certainly the work of Bennett on (universal) reversible Turing machines and the work of Fredkin and Toffoli on conservative logic. The latter is based upon the Fredkin gate, a rev...
متن کامل